n,m = map(int,input().split())
maxi = n
if n%2 == 0:
mini = n//2
else:
mini = ((n-1)//2) + 1
if mini%m == 0:
steps = mini
else:
steps = mini + m - (mini%m)
if steps <= maxi:
print(steps)
else:
print(-1)
#include<bits/stdc++.h>
using namespace std;
int n,m,cnt=1e5+10;
int main()
{
cin >> n >> m;
if(n<m) puts("-1");
else
{
int res=n%2==0?n/2:(n+1)/2;
while(res%m) res=res-1+2;
cout << res << endl;
}
}520A - Pangram | 124A - The number of positions |
1041A - Heist | 901A - Hashing Trees |
1283A - Minutes Before the New Year | 1654D - Potion Brewing Class |
1107B - Digital root | 25A - IQ test |
785A - Anton and Polyhedrons | 1542B - Plus and Multiply |
306A - Candies | 1651C - Fault-tolerant Network |
870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |
1153A - Serval and Bus | 1487C - Minimum Ties |
1136A - Nastya Is Reading a Book | 1353B - Two Arrays And Swaps |
1490E - Accidental Victory | 1335A - Candies and Two Sisters |
96B - Lucky Numbers (easy) | 1151B - Dima and a Bad XOR |
1435B - A New Technique | 1633A - Div 7 |
268A - Games | 1062B - Math |
1294C - Product of Three Numbers | 749A - Bachgold Problem |